Search results for "Verifiable secret sharing"
showing 10 items of 11 documents
Metric regularity and subdifferential calculus in Banach spaces
1995
In this paper we give verifiable conditions in terms of limiting Frechet subdifferentials ensuring the metric regularity of a multivalued functionF(x)=−g(x)+D. We apply our results to the study of the limiting Frechet subdifferential of a composite function defined on a Banach space.
Weight Adaptation Stability of Linear and Higher-Order Neural Units for Prediction Applications
2018
This paper is focused on weight adaptation stability analysis of static and dynamic neural units for prediction applications. The aim of this paper is to provide verifiable conditions in which the weight system is stable during sample-by-sample adaptation. The paper presents a novel approach toward stability of linear and higher-order neural units. A study of utilization of linear and higher-order neural units with the foundations on stability of the gradient descent algorithm for static and dynamic models is addressed.
On the social value of publicly disclosed information and environmental regulation
2018
Abstract This paper presents an analysis of environmental policy in imperfectly competitive market with publicly disclosed and privately-held information about costs. We examine the potential asymmetry-reducing role of disclosure and its impact on setting environmental taxes. From a policy perspective, our findings show that disclosure with verifiable reports, is a valuable public good, provides greater transparency in the market, and is generally efficiency enhancing. Results suggest that access to publicly disclosed information enables the fine-tuning of the tax rules towards specific environmental circumstances and improves the ability of the regulator to levy firm-specific environmental…
Finite state verifiers with constant randomness
2014
We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers. A corollary of our main result is that the class of outcome problems corresponding to O(log n)-space …
A Lyapunov–Razumikhin approach for stability analysis of logistics networks with time-delays
2012
Logistics network represents a complex system where different elements that are logistic locations interact with each other. This interaction contains delays caused by time needed for delivery of the material. Complexity of the system, time-delays and perturbations in a customer demand may cause unstable behaviour of the network. This leads to the loss of the customers and high inventory costs. Thus the investigation of the network on stability is desired during its design. In this article we consider local input-to-state stability of such logistics networks. Their behaviour is described by a functional differential equation with a constant time-delay. We are looking for verifiable conditio…
Approximations and Metric Regularity in Mathematical Programming in Banach Space
1993
This paper establishes verifiable conditions ensuring the important notion of metric regularity for general nondifferentiable programming problems in Banach spaces. These conditions are used to obtain Lagrange-Kuhn-Tucker multipliers for minimization problems with infinitely many inequality and equality constraints.
Qualification Conditions for Calculus Rules of Coderivatives of Multivalued Mappings
1998
AbstractThis paper establishes by a general approach a full calculus for the limiting Fréchet and the approximate coderivatives of multivalued mappings. This approach allows us to produce several new verifiable qualification conditions for such calculus rules.
Generalized person-by-person optimization in team problems with binary decisions
2008
In this paper, we extend the notion of person by person optimization to binary decision spaces. The novelty of our approach is the adaptation to a dynamic team context of notions borrowed from the pseudo-boolean optimization field as completely local-global or unimodal functions and sub- modularity. We also generalize the concept of pbp optimization to the case where the decision makers (DMs) make decisions sequentially in groups of m, we call it mbm optimization. The main contribution are certain sufficient conditions, verifiable in polynomial time, under which a pbp or an mbm optimization algorithm leads to the team-optimum. We also show that there exists a subclass of sub-modular team pr…
Tool-life modelling as a stochastic process
1998
Abstract In a previous paper [G. Galante, A. Lombardo, A. Passannanti, Proceedings of XXXVII Scientific Meeting of the Italian Statistical Society, 1994, p. 553] the Authors proposed to model cutting tool wear behaviour as a stochastic process with independent Gaussian increments plus drift. Such a model implies that the tool-life, i.e. the time to reach a fixed value of flank wear, has an inverse Gaussian probability distribution. The model has several practical and theoretical advantages. In fact, it is based on an easily and cheaply experimentally verifiable wear behaviour hypothesis, it is more flexible because it is not limited to a particular wear level and, finally, the data are bett…
Properties and constraints of cheating-immune secret sharing schemes
2006
AbstractA secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualified subsets. The setting we consider is the following: in a first phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qualified subset send in a secure way their shares to a trusted party, referred to as a combiner, who computes the secret and sends it back to the participants.Cheating-immune secret sharing schemes are secret sharing schemes in the above setting where dishonest participants, during the recons…